|
週次 |
日期 |
單元主題 |
|
第1週 |
2010/09/15 |
Foundations of Algorithms I <br>
<b>進度：</b>01講義pp.01~25<br> |
|
第2週 |
2010/09/22 |
<font color=RED>中秋節放假</font> |
|
第3週 |
2010/09/29 |
Foundations of Algorithms II <br>
<b>01講義更新2010/09/28(added pp.48~54)</b><br>
<b>進度：</b>01講義pp.26~50<br>
|
|
第4週 |
2010/10/06 |
Sorting and Order Statistics I<br>
<b>進度：</b>01講義pp.51~55(end)<br>
<b>進度：</b>02講義pp.01~31<br> |
|
第5週 |
2010/10/13 |
Sorting and Order Statistics II <br>
<b>Assignment #1 Due</b><br>
<b>進度：</b>02講義pp.32~54(end)<br>
<b>進度：</b>03講義pp.01~07<br>
|
|
第6週 |
2010/10/20 |
Algorithms on Trees I<br>
<b>進度：</b>03講義pp.08~56(end), 04講義pp.01~07<br>
<b>Proposal Due</b><br> |
|
第7週 |
2010/10/27 |
Algorithms on Trees II<br>
<b>進度：</b>04講義pp.08~40(end)<br> |
|
第8週 |
2010/11/03 |
Amortized Analysis<br>
<b>進度：</b>05講義全<br>
<b>Assignment #2 Due</b>
|
|
第9週 |
2010/11/10 |
Fibonacci Heaps<br>
Dynamic Programming<br>
<b>進度：</b>05-1講義全，06講義pp.01~08<br> |
|
第10週 |
2010/11/17 |
<b>Midterm</b> (Open note)<br>
<i>You may bring a one-page note, A4 size, double sided.</i><br>
<i>Bring a calculator just in case.</i><br> |
|
第11週 |
2010/11/24 |
Greedy Algorithms<br>
|
|
第12週 |
2010/12/01 |
Algorithms on Graphs I<br>
|
|
第13週 |
2010/12/08 |
Algorithms on Graphs II<br>
<b>Progress Report Due</b><br> |
|
第14週 |
2010/12/15 |
NP Completeness I<br>
<b>Assignment #3 Due</b><br> |
|
第15週 |
2010/12/22 |
NP-completeness II<br> |
|
第16週 |
2010/12/29 |
Approximation Algorithms<br>
|
|
第17週 |
2011/01/05 |
<b>Oral Presentations</b><br>
<b>Assignment #4 Due</b><br> |
|
第18週 |
2010/01/12 |
<b>Final</b><br>
<i>You may bring a one-page note, A4 size, double sided.<br>
Bring a calculator just in case.</i><br>
<b>Term paper due on 2001/01/17(Monday)</b><br> |